Generalized multiple objective bottleneck problems
نویسندگان
چکیده
منابع مشابه
Generalized multiple objective bottleneck problems
We consider multiple objective combinatorial optimization problems in which the first objective is of arbitrary type and the remaining objectives are either bottleneck or k-max objective functions. While the objective value of a bottleneck objective is determined by the largest cost value of any element in a feasible solution, the k-largest element defines the objective value of the k-max objec...
متن کاملThe approximability of three-dimensional assignment problems with bottleneck objective
We discuss two special cases of the three-dimensional bottleneck assignment problemwhere a certain underlying cost function satisfies the triangle inequality. We present polynomial time 2-approximation algorithms for the broadest class of these special cases, and we prove that (unless P = NP) this factor 2 is best possible even in the highly restricted setting of the Euclidean plane.
متن کاملA New Approach to Solve Multiple Objective Programming Problems
Multiple Objective Programming (MOP) problems have become famous among many researchers due to more practical and realistic implementations. There have been a lot of methods proposed especially during the past four decades. In this paper, we develop a new algorithm based on a new approach to solve MOP problems by starting from a utopian point (which is usually infeasible) and moving towards the...
متن کاملAqm Generalized Nyquist Stability in Multiple Bottleneck Networks ?
The influence of multiple bottlenecks on the stability of Active Queue Management (AQM) controllers, usually configured on a single bottleneck basis is discussed. We consider a network scenario where RED is configured at each router according to previously developed control theoretic techniques. These configuration rules assure stability in a single bottleneck scenario. We show that instability...
متن کاملEfficiently solving multiple objective optimal control problems
This paper discusses an improved method for solving multiple objective optimal control (MOOC) problems, and efficiently obtaining the set of Pareto optimal solutions. A general MOOC procedure has been introduced in Logist et al. [2007], to derive optimal generic temperature profiles for a steady-state tubular plug flow reactor. This procedure is based on a weighted sum of the different costs, a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research Letters
سال: 2012
ISSN: 0167-6377
DOI: 10.1016/j.orl.2012.03.007